Batch scheduling of deteriorating reworkables
نویسندگان
چکیده
منابع مشابه
Batch scheduling of deteriorating reworkables
The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. Each batch comprises two sub-batches processed consecutively. In the first subbatch, all the items are newly manufactured. Some of them are of the required good quality and some are defective. The defective items are re...
متن کاملBatch Scheduling of Deteriorating Products
In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. Each batch starts from the setup ...
متن کاملBatch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depending on its waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. For job i, if its waiting time is less than a given thr...
متن کاملScheduling Resumable Deteriorating Jobs
We consider the following single-machine time-dependent scheduling problem with constraints on the machine availability. There is given a set of independent and deteriorating jobs Jj , 1 ≤ j ≤ n, to be processed on a single machine, starting from time t0 > 0. The processing time pj of job Jj is a proportional function of the starting time Sj of this job, pj = αjSj, where Sj ≥ t0 and deteriorati...
متن کاملParallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection
We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted and processed on a single batching machine, or rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2008
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.06.079